NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs
نویسندگان
چکیده
منابع مشابه
Radiocoloring in planar graphs: Complexity and approximations
The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters, by exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modelled by variations of the graph coloring problem. A Radiocoloring (RC) of a graphG(V,E) is an assignment function : V → N such that | (u)− (v)| 2, when u, v are neighbors in ...
متن کاملRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modelled by variations of the graph coloring problem. A Radiocoloring (RC) of a graph G(V,E) is an assignment function Λ : V → IN such that |Λ(u) − Λ(v)| ≥ 2, when u, v are neighbors...
متن کاملOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
Hierarchical speci cations of graphs have been widely used in many important applications, such as VLSI design, parallel programming and software engineering. A well known hierarchical speci cation model, considered in this work, is that of Lengauer [9, 10], referred to as L-speci cations. In this paper we discuss a restriction on the Lspeci cations resulting to graphs which we call Well-Separa...
متن کاملInterdiction Problems on Planar Graphs
We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We give a multiplicative (1+ǫ)-approxi...
متن کاملThe Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Chvátal studied this problem under the name of the Decomposable Graph Recognition problem, and proved the problem to be NP-complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. Recently, unaware of Chvátal’s result, Patrignani and Pizz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000